Orbits of Antichains in Certain Root Posets

نویسندگان

  • Chao-Ping Dong
  • Suijie Wang
چکیده

Building everything from scratch, we give another proof of Propp and Roby’s theorem saying that the average antichain size in any reverse operator orbit of the poset [m] × [n] is mn m+n . It is conceivable that our method should work for other situations. As a demonstration, we show that the average size of antichains in any reverse operator orbit of [m] ×Kn−1 equals 2mn m+2n−1 . Here Kn−1 is the minuscule poset [n − 1] ⊕ ([1] ⊔ [1]) ⊕ [n − 1]. Note that [m] × [n] and [m] × Kn−1 can be interpreted as sub-families of certain root posets. We guess these root posets should provide a unified setting to exhibit the homomesy phenomenon defined by Propp and Roby.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On orbits of antichains of positive roots

For any finite poset P, there is a natural operator, X = XP, acting on the set of antichains of P. We discuss conjectural properties of X for some graded posets associated with irreducible root systems. In particular, if ∆ is the set of positive roots and Π is the set of simple roots in ∆, then we consider the cases P = ∆ and P = ∆ \ Π. For the root system of type An, we consider an X-invariant...

متن کامل

The order of birational rowmotion

Various authors have studied a natural operation (under various names) on the order ideals (equivalently antichains) of a finite poset, here called rowmotion. For certain posets of interest, the order of this map is much smaller than one would naively expect, and the orbits exhibit unexpected properties. In very recent work (inspired by discussions with Berenstein) Einstein and Propp describe h...

متن کامل

On Antichains in Product Posets

A corollary of Hilbert’s basis theorem is that any antichain in the set of n-dimensional vectors with non-negative entries is finite. In other words, any antichain in the poset given by cartesian powers of semi-infinite chains is finite. We study several variations of this result. We provide necessary and sufficient conditions for antichains in the cartesian product of posets to be finite or bo...

متن کامل

A Note on Blockers in Posets

The blocker A∗ of an antichain A in a finite poset P is the set of elements minimal with the property of having with each member of A a common predecessor. The following is done: (1) The posets P for which A∗∗ = A for all antichains are characterized. (2) The blocker A∗ of a symmetric antichain in the partition lattice is characterized. (3) Connections with the question of finding minimal size ...

متن کامل

Subpullbacks and Po-flatness Properties of S-posets

In (Golchin A. and Rezaei P., Subpullbacks and flatness properties of S-posets. Comm. Algebra. 37: 1995-2007 (2009)) study was initiated of flatness properties of right -posets  over a pomonoid  that can be described by surjectivity of  corresponding to certain (sub)pullback diagrams and new properties such as  and  were discovered. In this article first of all we describe po-flatness propertie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2017